Towards Temporal Graph Databases

نویسندگان

  • Alexander Campos
  • Jorge Mozzino
  • Alejandro A. Vaisman
چکیده

In spite of the extensive literature on graph databases (GDBs), temporal GDBs have not received too much attention so far. Temporal GBDs can capture, for example, the evolution of social networks across time, a relevant topic in data analysis nowadays. We propose a data model and query language (denoted TEG-QL) for temporal GDBs, based on the notion of attribute graphs. This allows a straightforward translation to Neo4J, a well-known GBD.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards a Query Language for Annotation Graphs

The multidimensional, heterogeneous, and temporal nature of speech databases raises interesting challenges for representation and query. Recently, annotation graphs have been proposed as a general-purpose representational framework for speech databases. Typical queries on annotation graphs require path expressions similar to those used in semistructured query languages. However, the underlying ...

متن کامل

An Introduction to Temporal Graph Data Management

This paper presents an introduction to the problem of temporal graph data management in the form of a survey of relevant techniques from database management and graph processing. Social network analytics, which focuses on finding interesting facts over static graphs, has gathered much attention lately. However, there hasn’t been much work on analysis of temporal or evolving graphs. We believe t...

متن کامل

Temporal Preprocessor: Towards Temporal Applications Development

Effective querying and managing of temporal databases represent an unanswered challenge to the modern research community. In this paper, we introduce a temporal preprocessor that can be used to aid in creation of temporal applications and for testing various methods and approaches in temporal databases implementations. We outline our proposal, current results and directions for further research...

متن کامل

Backlogs and Interval Timestamps: Building Blocks for Supporting Temporal Queries in Graph Databases

The analysis of networks, either at a single point in time or through their evolution, is an increasingly important task in modern data management. Graph databases are uniquely suited to improve static network analysis. However, there’s still no consensus on how to best model data evolution with these databases. In our work we propose an elementary concept to support temporal analysis with prop...

متن کامل

Towards a measure of vulnerability, tenacity of a Graph

If we think of the graph as modeling a network, the vulnerability measure the resistance of the network to disruption of operation after the failure of certain stations or communication links. Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including connectivity, integrity, toughness, binding number and tenacity.In this paper we discuss...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1604.08568  شماره 

صفحات  -

تاریخ انتشار 2016